Time-limited and k-limited polling systems: a matrix analytic solution
نویسندگان
چکیده
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the time-limited, and the k-limited service discipline. It is known that these disciplines do not satisfy the well-known branching property in polling system, therefore, hardly any exact result exists in the literature for them. Our strategy is to apply an iterative scheme that is based on relating in closed-form the joint queue-length at the beginning and the end of a server visit to a queue. These kernel relations are derived using the theory of absorbing Markov chains. Finally, we will show that our tool works also in the case of a tandem queueing network with a single server that can serve one queue at a time.
منابع مشابه
Numerical Solution of Polling Systems for Analyzing Networks on Chips
This paper introduces a numerical solution method for a class of discrete-time polling systems by relying on the power method, Kronecker matrix representations and the shuffle algorithm. The class of polling models considered consists of several infinite pseudo queues, deterministic service times, Bernoulli service and Markovian routing and includes exhaustive, 1-limited and k-limited service a...
متن کاملIterative approximation of k -limited polling systems
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, service and setup distributions. The interest for this model is fueled by an application in the field of logistics. Knowledge of the queue length distributions is needed to operate the system properly. The multi-queue ...
متن کاملIterative approximation of limited polling systems
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) limited service under the assumption of general arrival, service and setup distributions. The interest for this model is fueled by an application in the field of logistics. Knowledge of the queue length distributions is needed to operate the system properly. The multi-queue po...
متن کاملOrdinal Optimization of G/G/1/K Polling Systems with k-Limited Service Discipline
In this paper, we propose an ordinal optimization theory based algorithm to solve the optimization problem of G/G/1/K polling system with k-limited service discipline for a good enough solution using limited computation time. We assume that the arrival rates do not deteriorate visibly within a very short period. Our approach consists of two stages. In the first stage, we employ a typical geneti...
متن کاملAnalysis of two production inventory systems with buffer, retrials and different production rates
This paper considers the comparison of two ðs; SÞ production inventory systems with retrials of unsatisfied customers. The time for producing and adding each item to the inventory is exponentially distributed with rate b. However, a production rate ab higher than b is used at the beginning of the production. The higher production rate will reduce customers’ loss when inventory level appro...
متن کامل